Nuprl Lemma : strict-fun-connected_transitivity1
11,40
postcript
pdf
T
:Type,
f
:(
T
T
). retraction(
T
;
f
)
(
x
,
y
,
z
:
T
.
y
=
f
+(
x
)
z
is
f
*(
y
)
z
=
f
+(
x
))
latex
Definitions
Type
,
t
T
,
s
=
t
,
x
:
A
B
(
x
)
,
x
:
A
.
B
(
x
)
,
retraction(
T
;
f
)
,
y
is
f
*(
x
)
,
,
A
,
x
:
A
B
(
x
)
,
P
&
Q
,
Void
,
P
Q
,
False
,
y
=
f
+(
x
)
Lemmas
fun-connected
transitivity
,
fun-connected
antisymmetry
,
false
wf
,
not
wf
,
fun-connected
wf
,
retraction
wf
origin
T:Type, f:(T
T). retraction(T;f) 
(x, y, z:T. y = f+(x) z is f*(y) z = f+(x)) T:Type, f:(TT). retraction(T;f) (x, y, z:T. y = f+(x) z is f*(y) z = f+(x)) 
TB(x)x:A. B(x)
A
B(x) Q